github.com/klauspost/compress/huff0.nodeElt.nbBits (method)

16 uses

	github.com/klauspost/compress/huff0 (current package)
		compress.go#L524: 		huffNode[n].setNbBits(huffNode[huffNode[n].parent()].nbBits() + 1)
		compress.go#L527: 		huffNode[n].setNbBits(huffNode[huffNode[n].parent()].nbBits() + 1)
		compress.go#L539: 		nbPerRank[v.nbBits()]++
		compress.go#L554: 		s.cTable[v.symbol()].nBits = v.nbBits()
		compress.go#L614: 	largestBits := huffNode[lastNonNull].nbBits()
		compress.go#L624: 	for huffNode[n].nbBits() > maxNbBits {
		compress.go#L625: 		totalCost += baseCost - (1 << (largestBits - huffNode[n].nbBits()))
		compress.go#L631: 	for huffNode[n].nbBits() == maxNbBits {
		compress.go#L652: 				if huffNode[pos].nbBits() >= currentNbBits {
		compress.go#L655: 				currentNbBits = huffNode[pos].nbBits() // < maxNbBits
		compress.go#L690: 				huffNode[rankLast[nBitsToDecrease]].nbBits())
		compress.go#L696: 				if huffNode[rankLast[nBitsToDecrease]].nbBits() != maxNbBits-nBitsToDecrease {
		compress.go#L704: 				for huffNode[n].nbBits() == maxNbBits {
		compress.go#L707: 				huffNode[n+1].setNbBits(huffNode[n+1].nbBits() - 1)
		compress.go#L712: 			huffNode[rankLast[1]+1].setNbBits(huffNode[rankLast[1]+1].nbBits() - 1)
		compress.go#L738: func (e *nodeElt) nbBits() uint8  { return uint8(*e >> 56) }